Layout Area of the Hypercube
نویسندگان
چکیده
In this paper we study the square grid area required for laying out H l , the Boolean hypercube of N = 2 l vertices. It is shown that this area is 4 9 N 2 + o(N 2). We describe a layout which occupies this much area and prove that no layout of less area exists.
منابع مشابه
On the Area of Hypercube Layouts
This paper precisely analyzes the wire density and required area in standard layout styles for the hypercube. It shows that the most natural, regular layout of a hypercube of N nodes in the plane, in a N N grid arrangement, uses b2N=3c+ 1 horizontal wiring tracks for each row of nodes. (In the process, we see that the number of tracks per row can be reduced by 1 with a less regular design, as c...
متن کاملOn the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
We solve an open question posed by Akers and Krishnamurthy in 1986 [1, 3] concerning VLSI layout of star graphs. We show that the area of the optimal layout of an N-node star graph, hierarchical cubic network (HCN), or hierarchical folded-hypercube network (HFN) is N2=16 o(N2) under the Thompson model, or under the extended grid model where a node occupies a rectangle of sides that may range fr...
متن کاملNearly Optimal Three Dimensional Layout of Hypercube Networks
In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the ...
متن کاملUniversal Emulations with Sublogarithmic Slowdown
The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area w...
متن کاملVLSI Layouts of Complete Graphs and Star Graphs
In this paper, we present efficient layouts for complete graphs and star graphs. We show that an N-node complete graph can be optimally laid out using LN2/4] tracks for a colinear layout, and can be laid out in N4/16 + o(N4) area for a 2D layout. We also show that an N-node star graph can be laid out in N2/16 + o(N2) area, which is smaller than any possible layout of a similar-size hypercube. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Interconnection Networks
دوره 4 شماره
صفحات -
تاریخ انتشار 2003